Index
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form
B
- BatchProcessor<T,
S> - Class in edu.claflin.finder.logic.processor -
Used to process one or multiple objects.
- BatchProcessor() - Constructor for class edu.claflin.finder.logic.processor.BatchProcessor
-
Constructs a BatchProcessor.
- bestBitLength - Variable in class edu.claflin.finder.algo.clustering.struct.infomap_struct.InfomapImplementation
- BetweennessCentrality - Class in edu.claflin.finder.algo.clustering.struct.girvan_newman_struct
-
Computes betweenness centrality for each vertex and edge in the graph.
- BetweennessCentrality(Graph, boolean) - Constructor for class edu.claflin.finder.algo.clustering.struct.girvan_newman_struct.BetweennessCentrality
-
Calculates betweenness scores based on the all-pairs unweighted shortest paths in the graph.
- BetweennessCentrality.BetweennessComparator - Class in edu.claflin.finder.algo.clustering.struct.girvan_newman_struct
- BetweennessCentrality.BetweennessData - Class in edu.claflin.finder.algo.clustering.struct.girvan_newman_struct
- BetweennessComparator() - Constructor for class edu.claflin.finder.algo.clustering.struct.girvan_newman_struct.BetweennessCentrality.BetweennessComparator
- BetweennessData() - Constructor for class edu.claflin.finder.algo.clustering.struct.girvan_newman_struct.BetweennessCentrality.BetweennessData
- BFS(Map) - Method in class edu.claflin.finder.logic.cygrouper.CytogrouperMain
- BinarySearchTree<T extends TreeNodeInfo> - Class in edu.claflin.finder.algo.clustering.struct
- BinarySearchTree() - Constructor for class edu.claflin.finder.algo.clustering.struct.BinarySearchTree
-
Create an empty BinarySearchTree.
- BinarySearchTree(boolean) - Constructor for class edu.claflin.finder.algo.clustering.struct.BinarySearchTree
- bipartite - Variable in class edu.claflin.finder.algo.BronKerbosch
- BipartiteCondition - Class in edu.claflin.finder.logic.cond
-
Represents a bipartite graph as a Condition object.
- BipartiteCondition() - Constructor for class edu.claflin.finder.logic.cond.BipartiteCondition
- bitLengthCalculator - Variable in class edu.claflin.finder.algo.clustering.struct.infomap_struct.InfomapImplementation
- booleanList - Variable in class edu.claflin.finder.algo.ArgumentsBundle
-
The Mapping of String keywords to Notable Boolean values.
- BreadthFirstTraversalSearch - Class in edu.claflin.finder.algo
-
Processes a
Graphsearching for subgraphs by performing a breadth first search on each node of the graph. - BreadthFirstTraversalSearch(ArgumentsBundle) - Constructor for class edu.claflin.finder.algo.BreadthFirstTraversalSearch
-
Public constructor for initializing the BreadthFirstTraversalSearch with default conditions.
- bronKerbosch(List<List<Node>>, List<Node>, List<Node>, List<Node>) - Method in class edu.claflin.finder.algo.BronKerbosch
-
Recursive helper method to do the above.
- BronKerbosch - Class in edu.claflin.finder.algo
-
Bron-Kersboch Algorithm to find Maximal Cliques and Bicliques.
- BronKerbosch(ArgumentsBundle) - Constructor for class edu.claflin.finder.algo.BronKerbosch
-
Public constructor for initializing the Bron Kersbboch with default conditions.
- bronKerboschBiclique(Graph) - Method in class edu.claflin.finder.algo.BronKerbosch
-
Finds all bicliques within a bipartite graph.
- bronKerboschClique(Graph) - Method in class edu.claflin.finder.algo.BronKerbosch
-
Given a graph, finds all complete subgraphs.
- BronKersbochDriver - Class in edu.claflin.finder
- BronKersbochDriver() - Constructor for class edu.claflin.finder.BronKersbochDriver
- buildCommunityGraphs(List<List<Node>>, Graph, String) - Method in class edu.claflin.finder.algo.clustering.ClusteringAlgorithm
- Bundle - Class in edu.claflin.finder.algo
-
Processes a
Graphsearching for subgraphs. - Bundle(Algorithm[]) - Constructor for class edu.claflin.finder.algo.Bundle
-
Constructs the Algorithm object.
- bW - Variable in class edu.claflin.finder.log.LogUtil
-
The BufferedWriter used to log to a file.
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form